Search results for "Object Migration Automaton"

showing 1 items of 1 documents

The Power of the “Pursuit” Learning Paradigm in the Partitioning of Data

2019

Traditional Learning Automata (LA) work with the understanding that the actions are chosen purely based on the “state” in which the machine is. This modus operandus completely ignores any estimation of the Random Environment’s (RE’s) (specified as \(\mathbb {E}\)) reward/penalty probabilities. To take these into consideration, Estimator/Pursuit LA utilize “cheap” estimates of the Environment’s reward probabilities to make them converge by an order of magnitude faster. This concept is quite simply the following: Inexpensive estimates of the reward probabilities can be used to rank the actions. Thereafter, when the action probability vector has to be updated, it is done not on the basis of th…

Mathematical optimizationTheoretical computer scienceLearning automataBasis (linear algebra)Computer scienceRank (computer programming)Object PartitioningPartitioning-based learningEstimatorLearning Automata02 engineering and technologyProbability vectorField (computer science)AutomatonRanking0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing[INFO]Computer Science [cs]Object Migration Automaton
researchProduct